منابع مشابه
Relation Algebra with Binders
The language of relation algebras is expanded with variables denoting individual elements in the domain and with the ↓ binder from hybrid logic. Every elementary property of binary relations is expressible in the resulting language, something which fails for the relation algebraic language. That the new language is natural for speaking about binary relations is indicated by the fact that both C...
متن کاملRelation Algebra
Tarski’s algebra of binary relations is formalised along the lines of the standard textbooks of Maddux and Schmidt and Ströhlein. This includes relation-algebraic concepts such as subidentities, vectors and a domain operation as well as various notions associated to functions. Relation algebras are also expanded by a reflexive transitive closure operation, and they are linked with Kleene algebr...
متن کاملA Hierarchically Typed Relation Algebra
We consider a typed relation algebra which is used for a calculus of database preferences. So far, the typing mechanism does not cover unions of differently typed elements, which means that the global identity and the greatest element are not typable in the calculus. We suggest a hierarchical type structure to remedy this.
متن کاملA Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies (extended version)
In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to multi-modal logic enriched with features largely used in description logics: transitivity and relation inclusion assertions. The separate addition of either tra...
متن کاملA Finite Relation Algebra with Undecidable Network Satisfaction Problem
We deene a nite relation algebra and show that the network satisfaction problem is undecidable for this algebra 1. be a relation algebra (see JT52] for the original ax-iomatisation or Mad91] for an introduction to relation algebra). An atom a of A is a minimal, non-zero element. At(A) denotes the set of all atoms of A. A is atomic if for all non-zero a 2 A there exists 2 At(A) with a. In the fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2001
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/11.5.691